Method for solving origami tessellation hole problem using triangle twist folding

نویسندگان

چکیده

Abstract Origami tessellations are geometric pieces folded from a single sheet of paper with flatly overlapped facets. Most existing origami constructed by first marking grid crease lines on the and then arranging repeating patterns along grid. However, this design method is limited because it cannot that be represented grid, such as regular pentagon. This proposes new construction for solves problem enriches these varieties. In proposed method, boundary an tessellation determined first, called triangle twist fold placed inside boundary. A similar approach known hole problem, although in paper, redefined discussed form suitable tessellations. As result, grid-independent was proposed, were obtained using software implements method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Robotic Origami Folding Robotic Origami Folding

Origami, the art of paper sculpture, is a fresh challenge for the field of robotic manipulation, and provides a concrete example of the many difficulties and general manipulation problems faced in robotics. This paper describes our initial exploration, and highlights key problems in the manipulation, modeling, and design of foldable structures. Results include the design of the first origami-fo...

متن کامل

Journal of Problem Solving Conceptual Transformation and Cognitive Processes in Origami Paper Folding

Research on problem solving typically does not address tasks that involve following detailed and/or illustrated step-by-step instructions. Such tasks are not seen as cognitively challenging problems to be solved. In this paper, we challenge this assumption by analyzing verbal protocols collected during an Origami folding task. Participants verbalised thoughts well beyond reading or reformulatin...

متن کامل

A regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method

The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...

متن کامل

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Design and Engineering

سال: 2022

ISSN: ['2288-5048', '2288-4300']

DOI: https://doi.org/10.1093/jcde/qwab074